Privacy issues and protection in secure data outsourcing

Utilizing database encryption to safeguard data in several conditions where access control is not sufficient is unavoidable. Database encryption offers an extra layer of security to traditional access control methods. It stops users that are unauthorized, such as hackers breaking into a system, and observing private data. Consequently, data is safe even when the database is stolen or attacked. Nevertheless, the process of data decryption and encryption causes degradation in the database performance. In conditions where the entire information is kept in an encrypted format, it is not possible to choose the database content any longer. The data must be first decrypted, and as such, the unwilling and forced tradeoff occurs between the function and the security. The suitable methods to improve the function are techniques that directly deal with the data that is encrypted without having to decrypt them first. In this study, we determined privacy protection and issues that each organization should consider when it decides to outsource own data

Designing a maintenance free multi-channel wireless sensor network protocol

Wireless sensors are low powered device that is scattered to monitor its surroundings. These energy-constrained devices are usually constructed in a hierarchical structured manner where after sometime some of the nodes may deplete energy resulting disruption of the routing topology in a wireless sensor network. A faulty parent node may cause the reconstruction of the network’s routing topology if a maintenance solution is not provided to the protocol. Thus this study focuses on the maintenance free environment for a multi-channel wireless sensor network. A tree-based solution is proposed for the multi-channel protocol and a route diversion is proposed for the maintenance solution. The multi-channel characteristics is used as a tool to determine the route diversion of the children node. A simulation is built to compare the proposed protocol with existing tree-based multi-channel protocol. The result of the proposed protocol shows an improvement to the packet delivery rate by 15%

VoIP based tele-medicine call center-issues, challenges and proposed solution

In recent years, medical call centers have started using IP telephony services to minimize the overhead telecom expenses. However, the advent of Voice-Over-IP (VoIP) technology has also created a major discontinuity in telecommunication sector due to illegal VoIP or gray calls, causing a great impact on the voice market. This brought few challenges to the countries' regulatory bodies. In this paper, we spell out one of the key challenges: in order to mitigate illegal VoIP calls, whether the regulatory body should allow IP telephony to be practiced for both domestic and international voice driven tele-medical consultation center operation combined or separately. We propose architecture and schemes for a medical call center. We also propose some guidelines and/or policies for both call center operator and the telecom regulatory authority. The proposed architecture and schemes are implemented in a pilot project basis in two phases and the test bed result is presented in this article

A survey on self-organized cluster-based wireless sensor network

Study on Wireless Sensor Network (WSN) has been expended enormously in recent years. Sensor nodes are deployed in harsh environment which is operated autonomously. Network formation of WSNs are of two types, namely flat network and cluster-based network. Cluster-based network has various advantages as compare to flat network such as, efficient topology management, energy efficiency, minimized delay, better network communication, etc. Another important feature of cluster-based network is self-organized network. Self-organized enables new nodes joining to increase the coverage of the network and existing nodes leaving the network as node have limited energy. In recent years the demand of self-organized network is tremendously increasing to overcome the problem of node joining and leaving which maintain the smooth data communication. Thus, this survey addresses latest research works regarding self-organized cluster-based network. Moreover, a unique performance matrix is also investigated in this article to measure the algorithms. Finally, open research issues are highlighted for self-organized clustering schemes that might be future line of action

Time-efficient data congregation protocols on wireless sensor networks

This paper focuses on time-efficient data congregation protocols on a Dynamic Cluster-based Wireless Sensor Network (CBWSN). The CBWSN is self-configurable and re-configurable, thus capable of performing two dynamic operations: node-move-in and node-move-out. In this paper, we propose two efficient congregation techniques for Dynamic CBWSN. In order to facilitate the efficient congregation protocols we propose an improved cluster-based structure. In this structure, we first construct a communication highway, and then improve the cluster-based structure to facilitate efficient congregation protocols such that the nodes of the network can perform inter and intra cluster communications efficiently. We also study the time complexity of the protocols

A comparative analysis of ICT developments in developing and developed countries

The most exposed advancement in this era of globalization has been the Information and Communication Technology (ICT) influx. It has turned the world into a global village with boundless connectively, interactive organizations, information sharing and infinite accesses across the globe. It is a cross-cutting issue as well as an indispensable instrument for social and economic development. For decades ICT has been playing an important role in creating employment, hovering work skills and production. The adoption of ICT can dramatically reduce corruption from a society, thus can bring forward-looking governance in the country. The life and livelihood of a large number of populations, especially those living in rural areas, cannot be developed without utilizing the ICT scope for them. However, Bangladesh, a developing country, with huge potential, despite many problems still far away from using ICT, when the whole world is getting developed with the blessings of ICT. Malaysia, another developing country, was once seen as potential high-tech hub that is downplaying its role now and has focused on developing its own infrastructure. On the other hand, Japan as a developed country and one of the top industrialized countries in the world, has been able to exploit the all-out paybacks from ICT till date. In this paper, we provide a comprehensive empirical analysis on Information and Communication in developing and developed countries where Bangladesh, Malaysia and Japan are the study regions. We also provide a comparative analysis, raise some future challenges and describe the steps taken forward for the ICT development in these regions before providing a set of recommendations for these nations which also can be adopted by other developing countries

A better dynamic cluster-based structure of wireless sensor network for efficient routing

In recent years, wireless sensor networks have gained a tremendous amount of attention due to their potential ability in providing solutions in various areas such as health care, environment, defense, surveillance, industry and transport. Typically, the sensors are small, with limited processing and computing resources and thus useful for network operations. In this paper, we present an improved Dynamic Cluster-based Wire- less Sensor Network (WSN) that facilitates an efficient routing protocol. The cluster- based structure presented here is self-constructible and reconfigurable and is supported by two atomic operations: node-move-in and node-move-out. Our routing protocol finds routes on graph G, unlike some previous routing protocols that find routes on the struc- ture in a similar cluster-based structure. For the two operations we also propose two algorithms: Node-Move-In and Node-Move-Out. We show that to establish a route on graph G using the structure, it requires O(p) rounds, where p is the number of clusters in the network. Note that, in a scenario where the number of sensor nodes n is enormous, p is much less than n. We also show that the proposed Node-Move-In and Node-Move-Out algorithms require expected O(q) and O(jTj) rounds, respectively. Here q is the number of neighbors in G of the node that wish to join to an existing cluster-based structure and T is the sub-tree of the structure whose root is the leaving node. Finally, our simulation results describe that the proposed routing protocol finds a better route with less length and using less computational time